# -*- coding: UTF-8 -*-
import sys
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def distributeCookies(self, cookies: List[int], k: int) -> int:
        cookies_count = len(cookies)
        if cookies_count == k:
            return max(cookies)

        ans = sys.maxsize

        def backtrace(buckets: List[int], start: int):
            nonlocal ans
            if start == cookies_count:
                ans = min(max(buckets), ans)
                return

            for i in range(k):
                if start == 0 and i > 0:
                    return

                if max(buckets) > ans:
                    return

                buckets[i] += cookies[start]
                backtrace(buckets, start + 1)
                buckets[i] -= cookies[start]

        cookies.sort()
        backtrace([0] * k, 0)
        return ans


if __name__ == '__main__':
    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([8, 15, 10, 20, 8], 2, 31),
        ([6, 1, 3, 2, 2, 4, 1, 2], 3, 7)
    ]

    for case_item in testcases:
        solution = Solution()
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]

        expect = case_item[len(case_item) - 1]
        exec_result = solution.distributeCookies(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

